Using Regret Estimation to Solve Games Compactly

Source URL: poker.cs.ualberta.ca

• Game theory
• Academia
• Abstraction
• Mathematics
• Solved game
• Mathematical game
• Computational complexity theory
• Mathematical problem
• Nash equilibrium
• Regression analysis
• Extensive-form game

AltAlt: Combining the Advantages of Graphplan and Heuristic State Search Romeo Sanchez Nigenda, XuanLong Nguyen & Subbarao Kambhampati Department of Computer Science and Engineering Arizona State University, Tempe AZ 852

Source URL: rakaposhi.eas.asu.edu

• Search algorithms
• Heuristics
• Mathematics
• Cognition
• Admissible heuristic
• Graphplan
• Computational complexity theory
• Algorithm
• Hyper-heuristic
• Book:Graph Theory

Complexity Theory for Operators in Analysis Akitoshi Kawamura Stephen Cook University of Toronto

Source URL: www.cs.utoronto.ca

THE COMPLEXITY OF SATISFACTION PROBLEMS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Satisfiability problems play a central role in computer science and engineering as a general framework for studying the complexity of

Source URL: ludovicpatey.com

• Automated theorem proving
• Logic programming
• Logic in computer science
• Boolean algebra
• Model theory
• Substitution
• Boolean satisfiability problem
• Interpretation
• Relationships among probability distributions
• Lifting theory

Microsoft Word - 070824_ICCSPaper_EMMV2.doc

Source URL: necsi.edu

• Complex systems theory
• Information systems
• Management
• Systems
• Decision theory
• Systems engineering
• Emergence
• Information management
• Project management
• Complexity
• Decision support system
• Requirement

Sample Complexity of Composite Likelihood Joseph K. Bradley Carlos Guestrin Carnegie Mellon University

Source URL: select.cs.cmu.edu

• Statistics
• Estimation theory
• Statistical theory
• Maximum likelihood estimation
• Efficient estimator
• Estimator
• Likelihood function
• Normal distribution
• Loss function
• Consistent estimator

Maximizing Submodular Set Function with Connectivity Constraint: Theory and Application to Networks Tung-Wei Kuo† ‡ , Kate Ching-Ju Lin† , and Ming-Jer Tsai‡ † Research Center for Information Technology Innova

Source URL: nms.citi.sinica.edu.tw

• Mathematics
• Graph theory
• Computational complexity theory
• Combinatorial optimization
• Submodular set function
• Edsger W. Dijkstra
• NP-complete problems
• Algorithm
• Shortest path problem
• HeldKarp algorithm
• Dominating set

Why walking the dog takes time: Fr´echet distance has no strongly subquadratic algorithms unless SETH fails Karl Bringmann∗ April 10, 2014 Abstract

Source URL: people.mpi-inf.mpg.de

• Computational complexity theory
• Theory of computation
• Exponential time hypothesis
• Time complexity
• NC
• Gadget

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 7, JULYrequiring the storage of O (d) cells. Since each cell has j6j + 1 entries, the space complexity is in O(min(d2 j6j log r; d(n 0 d)j6j log j6j)) bits. Th

Source URL: dept.stat.lsa.umich.edu

• Statistical theory
• Operations research
• Systems engineering
• Signal processing
• Digital signal processing
• Quantization
• Dynamic programming
• KullbackLeibler divergence
• Information theory
• Optimal design

Applications and Limitations of Complexity Theory in Organization Theory and Strategy David L. Levy University of Massaclzusetts, Boston, Massachusetts

Source URL: www.faculty.umb.edu